Return to the Middle Ages: A Half-Angle Iteration for the Logarithm of a Unitary Matrix

نویسندگان

  • Sheung Hun Cheng
  • Nicholas J. Higham
  • Charles S. Kenney
  • Alan J. Laub
چکیده

If A is unitary then A = eiH = cos H + i sin H where H is Hermitian. We examine the problem of approximating H . The standard approach to approximating logarithms is to take successive square roots until A1/2 n is close to the identity and then apply a Padé approximation to log A = 2n log A1/2 n . For the unitary problem we have A1/2 n = cos(H/2n) + i sin(H/2n) which suggests the use of halfangle formulas in computing the square roots. In this paper we consider problems associated with incomplete DenmanBeavers square root approximations as applied to the halfangle formulation. Square roots of unitary matrices are again unitary and the desire to have approximate square roots retain this property leads us to a tangent formulation of the halfangle iteration. Numerical tests illustrate this new procedure on a variety of examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properties of matrices with numerical ranges in a sector

Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...

متن کامل

New Bases for Polynomial-Based Spaces

Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...

متن کامل

A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

متن کامل

Iterative Approach for Automatic Beam Angle Selection in Intensity Modulated Radiation Therapy Planning

Introduction: Beam-angle optimization (BAO) is a computationally intensive problem for a number of reasons. First, the search space of the solutions is huge, requiring enumeration of all possible beam orientation combinations. For example, when choosing 4 angles out of 36 candidate beam angles, C36 = 58905 possible combinations exist.  Second, any change in a   beam 4 config...

متن کامل

A stable iteration to the matrix inversion

The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000